Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(x) |
→ g(f(x)) |
| 2: |
|
g(f(x)) |
→ x |
| 3: |
|
g(x) |
→ a |
|
There are 2 dependency pairs:
|
| 4: |
|
F(x) |
→ G(f(x)) |
| 5: |
|
F(x) |
→ F(x) |
|
The approximated dependency graph contains one SCC:
{5}.
-
Consider the SCC {5}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006